On the directed cut cone and polytope

نویسندگان

  • David Avis
  • Conor Meagher
چکیده

In this paper we study the directed cut cone and polytope which are the positive hull and convex hull of all directed cut vectors of a complete directed graph, respectively. We present results on the polyhedral structure of these polyhedra. A relation between directed cut polyhedra and undirected cut polyhedra is established that provides families of facet defining inequalities for directed cut polyhedra from those known for undirected cut polyhedra.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A remark on asymptotic enumeration of highest weights in tensor powers of a representation

We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...

متن کامل

Facets for the cut cone I

We study facets of the cut cone C,, i.e., the cone of dimension 1⁄2n(n 1) generated by the cuts of the complete graph on n vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a "'lifting" procedure for constructing facets of C~ +1 from given facets of t...

متن کامل

Exponential lower bounds on fixed-size psd rank and semidefinite extension complexity

There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P . In a breakthrough paper Fiorini et al. [FMP12] showed that any linear programming formulation of maximum-cut must have exponential size. A natural question to ask is whether one can prove such strong lower bounds for semidefinite programming formulations. In ...

متن کامل

Facets for the cut cone II: Clique-web inequalities

We study new classes of facets for the cut cone C, generated by the cuts of the complete graph on n vertices. This cone can also be interpreted as the cone of all semi-metrics on n points that are isometrically l~-embeddable and, in fact, the study of the facets of the cut polytope is in some sense equivalent to the study of the facets of C~. These new facets belong to the class of clique-web i...

متن کامل

The inequicut cone

Deza, M., K. Fukuda and M. Laurent, The inequicut cone, Discrete Mathematics 119 (1993) 21-48. Given a complete graph K, on n nodes and a subset S of nodes, the cut 6(S) defined by S is the set of edges of K, with exactly one endnode in S. A cut 6(S) is an equicut if ISI =L n/2 1 or r n/2 1 and an inequicut, otherwise. The cut cone C. (or inequicut cone 1C.) is the cone generated by the inciden...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Optim.

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2016